Note on a Fibonacci parity sequence
نویسندگان
چکیده
Let ftm = 0111010010001⋯ be the analogue of Thue-Morse sequence in Fibonacci representation. In this note we show how, using Walnut theorem-prover, to obtain exact value its maximum order complexity, previously studied by Jamet, Popoli, and Stoll. We strengthen one their theorems disprove conjectures.
منابع مشابه
A Note on Fibonacci-type Polynomials
We opt to study the convergence of maximal real roots of certain Fibonacci-type polynomials given by Gn = xGn−1 + Gn−2. The special cases k = 1 and k = 2 were done by Moore, and Zeleke and Molina, respectively. 1. Main Results In the sequel, P denotes the set of positive integers. The Fibonacci polynomials [2] are defined recursively by F0(x) = 1, F1(x) = x and Fn(x) = xFn−1(x) + Fn−2(x), n ≥ 2...
متن کاملA Note on the Bounds for the Generalized Fibonacci-P-Sequence and its Application in Datahiding
In this paper, we suggest a lower and an upper bound for the Generalized Fibonaccip-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two consecutive terms in generalized Fibonacci sequence converges to a p-degree polynomial and then use this result to prove the bounds for generalized Fibonacci-...
متن کاملA note on the parity assignment problem
The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The accuracy of any instructions, formulae and drug doses should be independently verified with primary sources. The publisher shall not be liable for any loss, actions, claims, proceedings, demand or costs or damages whatsoever or howsoever caused...
متن کاملNote on a matroid with parity conditon
This paper presents a theorem concerning a matroid with the parity condition. The theorem provides matroid generalizations of graph-theoretic results of Lewin [3] and Gallai [1]. Let M=(E, F) be a matroid, where E is a finite set of elements and F is the family of independent sets of M (in this paper, we presuppose a knowledge of matroid theory; our standard reference is Welsh [4]). Assume that...
متن کاملA note on parity constrained orientations
This note extends the results of Frank, Jordán, and Szigeti [1] on parity constrained orientations with connectivity requirements. Given a hypergraph H, a non-negative intersecting supermodular set function p, and a preferred in-degree parity for every node, a formula is given on the minimum number of nodes with wrong in-degree parity in an orientation of H covering p. It is shown that the mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptography and Communications
سال: 2022
ISSN: ['1936-2455', '1936-2447']
DOI: https://doi.org/10.1007/s12095-022-00592-5